Integration of spatial join algorithms for processing multiple inputs
نویسندگان
چکیده
منابع مشابه
Integration of Spatial Join Algorithms for Joining Multiple Inputs
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined inputs, while others treat datasets with no index, thus providing solutions for the case where at least one input comes as an intermediate result of another database operator. In this paper we analyze previous work on...
متن کاملDistance Join Queries of Multiple Inputs in Spatial Databases
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects that make up this n-tuple, according to the edges of the QG. This paper addresses the problem of finding the K n-tuples between n spatial datasets that have the smallest Ddistancevalues, the so-called K-Multi-Way Distanc...
متن کاملData-Parallel Spatial Join Algorithms
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data (i.e., Bureau of the Census TIGER/Line les). Parallel algorithms for map intersection and a spatial range query are described. The algorithms are implemented using the SAM (Scan-AndMonotonic-mapping) model of parallel computa...
متن کاملMultilevel Data Clustering for Spatial Join Processing
Thc spatial join is a cuminon spalid query typc that requires n high processing cost due lo thc largc volume of spatial detil and the computntion-iiitcnsivc spatial opcrntions [ I , 12, 13, 141. A spalial join consists in testing cvcry two possible pairs of objects hdoinging to two spatia? daln sets against n spalial predicatc [ 1 I ] . This prcdicnte might be flveriiip, cross, wilhiit distaric...
متن کاملEfficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for data sets which are updated infrequently. The I/O cost of join computation using a join-index with limited buffer space depends primarily on the page-access sequence used to fetch the pages of the base relations. Given ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 1999
ISSN: 0163-5808
DOI: 10.1145/304181.304183